An Algorithm for Node-Disjoint Paths in Pancake Graphs
نویسندگان
چکیده
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n − 1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation. key words: pancake graphs, node-to-node disjoint paths problem, interconnection networks, parallel and distributed processing
منابع مشابه
Node-to-Set Disjoint Paths Problem in Pancake Graphs
In this paper, we give an algorithm for the nodeto-set disjoint paths problem in pancake graphs with its evaluation results. The algorithm is of polynomial order of n for an n-pancake graph. It is based on recursion and divided into two cases according to the distribution of destination nodes in classes into which all the nodes in a pancake graph are categorized. The sum of lengths of paths obt...
متن کاملNode-to-Set Disjoint Paths Problem in Burnt Pancake Graphs
A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we focus on n-burnt pancake graphs and propose an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the...
متن کاملOne-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n− 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n − 1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k − 7, and the algorithm has time complexity O(k2n2). keywords: interco...
متن کاملNode-to-Set Disjoint Paths Problem in Rotator Graphs
In this paper, we give an algorithm for the nodeto-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are...
متن کاملOn Fixed-Parameter Tractability of Some Routing Problems
Disjoint Paths is the problem of finding paths between given pairs of terminals in a graph such that no vertices are shared between paths. We analyze fixed-parameter tractability of several new Disjoint Paths-like routing problems motivated by congestion control in computer networks. In one model we are interested in finding paths between k pairs of terminals such that the first edge of each pa...
متن کامل